Robust optical flow estimation - Information Intelligence and Systems, 1999. Proceedings. 1999 International Conference on

نویسندگان

  • Jose Otero
  • Adolfo Otero
چکیده

In this paper a new robust estimator of the optical flow field is shown. Arising from the techniques based on the O.EC. (Optical Flow Constrain), we develop an estimation that takes several measures around a given pixel and discards the erroneous ones, using a voting schema. In this way, velocities that have more accumulated votes are taken as the correct ones. A preliminary comparison with other well known techniques is shown, and clearly our approach performs quite bette6 even in the cases where two o r more movements are present in the analyzed pixels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

United States Patent Hull et al

and pp. 5/1-5/2. Langley "An Analysis of Bayesian Classifiers," Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 223-228, 1992. Langley "Induction of Selective Bayesian Classifiers," Proceedings of the Tenth National Conference on Uncertainty in Artificial Intelligence, pp. 400-406, (1994). Li et al. "Automatic Text Detection and Tracking in Digital Video," IEEE Tran...

متن کامل

Computation Optical Flow Using Pipeline Architecture

Accurate estimation of motion from time-varying imagery has been a popular problem in vision studies, This information can be used in segmentation, 3D motion and shape recovery, target tracking, and other problems in scene analysis and interpretation. We have presented a dynamic image model for estimating image motion from image sequences, and have shown how the solution can be obtained from a ...

متن کامل

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages

Boosting is a general method for improving the accuracy of any given learning algorithm. This short paper introduces the boosting algorithm AdaBoost, and explains the underlying theory of boosting, including an explanation of why boosting often does not suuer from overrtting. Some examples of recent applications of boosting are also described.

متن کامل

Recent Advances in AI Planning

ion and Approximate DecisionTheoretic Planning. Journal of Artificial Intelligence 89(1–2): 219–283. Proving to Problem Solving. In Proceedingsof the First International Joint Conference on Artificial Intelligence, 219–239. MenloPark, Calif.: International Joint Conferences on Artificial Intelligence. Haas, A. 1987. The Case for Domain-Specific Frame Axioms. In The Frame Problem in Arti...

متن کامل

3D Pose Tracking with Linear Depth and Brightness Constraints

This paper explores the direct motion estimation problem assuming that video-rate depth information is available, from either stereo cameras or other sensors. We use these depth measurements in the traditional linear brightness constraint equations, and we introduce a new depth constraint equation. As a result, estimation of certain types of motion, such as translation in depth and rotations ou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004